Probabilistic Alternating-Time <em>µ</em>-Calculus
نویسندگان
چکیده
منابع مشابه
Probabilistic Alternating-Time Temporal Logic
A probabilistic variant of ATL∗ logic is proposed to work with multi-player games of incomplete information and synchronous perfect recall. The semantics of the logic is settled over probabilistic interpreted system and partially observed probabilistic concurrent game structure. While unexpectedly, the model checking problem is in general undecidable even for singlegroup fragment, we find a fra...
متن کاملOn Probabilistic Time versus Alternating Time
We prove several new results regarding the relationship between probabilistic time, BPTime (t), and alternating time, ΣO(1)Time (t). Our main results are the following: 1. We prove that BPTime (t) ⊆ Σ3Time (t · poly log t). Previous results show that BPTime (t) ⊆ Σ2Time ( t2 · log t ) (Sipser and Gács, STOC ’83; Lautemann, IPL ’83) and BPTime (t) ⊆ ΣcTime (t) for a large constant c > 3 (Ajtai, ...
متن کاملAlternating Epistemic Mu-Calculus
Alternating-time temporal logic (ATL) is a wellknown logic for reasoning about strategic abilities of agents. An important feature that distinguishes variants of ATL for imperfect information scenarios is that the standard fixed point characterizations of temporal modalities do not hold anymore. In this paper, we show that adding explicit fixed point operators to the “next-time” fragment of ATL...
متن کاملOn Probabilistic Alternating Simulations
This paper presents simulation-based relations for probabilistic game structures. The first relation is called probabilistic alternating simulation, and the second called probabilistic alternating forward simulation, following the naming convention of Segala and Lynch. We study these relations with respect to the preservation of properties specified in probabilistic alternating-time temporal lo...
متن کاملA Probabilistic Real-Time Calculus for Performance Evaluation
In this paper we develop a probabilistic real-time calculus for performance evaluation. The calculus applies a simple generative model of probabilities. Next to probabilistic action transitions, probabilistic time transitions are supported. An operational characterization is given in terms of a labelled transition system. The operational rules for the real-time part of the calculus are construc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2019
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v33i01.33016179